- decidable theory
- мат.разрешимая теория
English-Russian scientific dictionary. 2008.
decidable theory
Смотреть что такое "decidable theory" в других словарях:
Decidable sublanguages of set theory — In mathematical logic, various sublanguages of set theory are decidable.[1][2] These include: Sets with Monotone, Additive, and Multiplicative Functions.[3] Sets with restricted quantifiers.[4] References ^ Cantone, D., E. G … Wikipedia
Decidable — The word decidable may refer to: Decidable language Decidability (logic) for the equivalent in mathematical logic Gödel s incompleteness theorem, a theorem on the indecidability of languages consisting of true statements in mathematical logic.… … Wikipedia
Theory (mathematical logic) — This article is about theories in a formal language, as studied in mathematical logic. For other uses, see Theory (disambiguation). In mathematical logic, a theory (also called a formal theory) is a set of sentences in a formal language. Usually… … Wikipedia
Theory of computation — In theoretical computer science, the theory of computation is the branch that deals with whether and how efficiently problems can be solved on a model of computation, using an algorithm. The field is divided into three major branches: automata… … Wikipedia
Recursion theory — Recursion theory, also called computability theory, is a branch of mathematical logic that originated in the 1930s with the study of computable functions and Turing degrees. The field has grown to include the study of generalized computability… … Wikipedia
Computability theory — For the concept of computability, see Computability. Computability theory, also called recursion theory, is a branch of mathematical logic that originated in the 1930s with the study of computable functions and Turing degrees. The field has grown … Wikipedia
Intuitionistic type theory — Intuitionistic type theory, or constructive type theory, or Martin Löf type theory or just Type Theory is a logical system and a set theory based on the principles of mathematical constructivism. Intuitionistic type theory was introduced by Per… … Wikipedia
Reduction (recursion theory) — In computability theory, many reducibility relations (also called reductions, reducibilities, and notions of reducibility) are studied. They are motivated by the question: given sets A and B of natural numbers, is it possible to effectively… … Wikipedia
Computable model theory — is a branch of model theory which deals with questions of computability as they apply to model theoretical structures. It was developed almost simultaneously by mathematicians in the West, primarily located in the United States and Australia, and … Wikipedia
Langage partiellement décidable — Récursivement énumérable En théorie de la calculabilité, un ensemble récursivement énumérable ou semi décidable est un ensemble qui est le domaine de définition, ou, de façon équivalente, l image d un fonction calculable (il faut ajouter l… … Wikipédia en Français
Krohn–Rhodes theory — In mathematics and computer science, Krohn Rhodes theory is an approach to the study of finite semigroups and automata that seeks to decompose them in terms of elementary components. These turn out to correspond to finite aperiodic semigroups and … Wikipedia
